4 General State Space Markov Chains and Mcmc Algorithms
نویسنده
چکیده
Abstract. This paper surveys various results about Markov chains on general (noncountable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which follows. Then, sufficient conditions for geometric and uniform ergodicity, along with quantitative bounds on the rate of convergence to stationarity in terms of minorisation and drift conditions, are presented. Many of these results are proved using direct coupling constructions. Necessary and sufficient conditions for Central Limit Theorems (CLTs) are also presented, in some cases proved via the Poisson Equation or direct regeneration constructions. Finally, optimal scaling and weak convergence results for Metropolis-Hastings algorithms are discussed. None of the results presented is new, though many of the proofs are. We also describe some Open Problems.
منابع مشابه
General state space Markov chains and MCMC algorithms
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which follows. Then, sufficient conditions for geometric and uniform ergodicity are presented, along with quantitative bounds on the rate of convergence to stationarit...
متن کاملParticle Markov Chain Monte Carlo
Markov chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) methods have emerged as the two main tools to sample from high-dimensional probability distributions. Although asymptotic convergence of MCMC algorithms is ensured under weak assumptions, the performance of these latters is unreliable when the proposal distributions used to explore the space are poorly chosen and/or if highly corr...
متن کاملOrthogonal parallel MCMC methods for sampling and optimization
Monte Carlo (MC) methods are widely used in statistics, signal processing and machinelearning. A well-known class of MC methods are Markov Chain Monte Carlo (MCMC)algorithms. In order to foster better exploration of the state space, specially in high-dimensional applications, several schemes employing multiple parallel MCMC chains have beenrecently introduced. In this work, ...
متن کاملAdaptive MCMC: Background, Theory, and Simulations
This research report was written during the summer of 2006 under Professor Jeffrey Rosenthal with the support of NSERC USRA. There are two major purposes to this research report. The first is to summarize the theoretical foundations of adaptive MCMC, including necessary backgrounds in measure theory, general state-space Markov chains, and non-adaptive MCMC so that a strong undergraduate math st...
متن کاملNonasymptotic bounds on the estimation error for regenerative MCMC algorithms∗
MCMC methods are used in Bayesian statistics not only to sample from posterior distributions but also to estimate expectations. Underlying functions are most often defined on a continuous state space and can be unbounded. We consider a regenerative setting and Monte Carlo estimators based on i.i.d. blocks of a Markov chain trajectory. The main result is an inequality for the mean square error. ...
متن کامل